The collapse of the bounded width hierarchy
نویسنده
چکیده
We show that every constraint satisfaction problem over a fixed constraint language that has bounded relational width has also relational width (2, 3). Together with known results this gives a trichotomy for width: a constraint satisfaction problem has either relational width 1, or relational width (2, 3) (and no smaller width), or does not have bounded relational width.
منابع مشابه
Tree-width and the monadic quantifier hierarchy
It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is closed under minors, then K contains all planar graphs. But on planar graphs, three-colorability ...
متن کاملChapters on Bounded Arithmetic
We characterize the collapse of Buss’ bounded arithmetic in terms of the prov able collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
متن کاملNotes on Polynomially Bounded Arithmetic
We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
متن کاملChapters on Bounded Arithmetic
We characterize the collapse of Buss bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general 1nodel theoretical investigations on fragments of bounded arithmetic.
متن کاملPolynomial Arithmetic 3
(1) Many typos have been corrected (2) Some redoundancy has been eliminated Notes on polynomially bounded arithmetic Abstract We characterize the collapse of Buss' bounded arithmetic in terms of the prov-able collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 26 شماره
صفحات -
تاریخ انتشار 2016